Penerapan k-Means Clustering Berdasarkan Analisis RFM Terhadap Segmentasi Pembeli untuk Meningkatkan Strategi CRM
نویسندگان
چکیده
An industry requires a good strategy in running its business. Saga Bako is small that sells various types of tobacco and equipment. However, has not yet implemented Customer Relationship Management (CRM) service to buyers. It necessary segment customers find out less profitable buyers who provide large profits. The use data mining also contributes when segmenting through the purchase data. methodology applied this research CRISP-DM with at from January March 2022. k-means algorithm formation clusters based on Recency, Frequency, Monetary (RFM) model, help Weka 3.8.5 tools. Elbow method used determine best number (k). results obtained are 47 663 transaction divided into three clusters, 26 low potential buyers, ten medium 11 high
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملEvaluation of selected analyte protectant to improve performance of gas chromatographic analysis of pesticide residues (Penilaian pelindung anilit terpilih untuk meningkatkan prestasi analisis kromatografi gas residu pestisid)
The effectiveness of three analyte protectants, namely, D-sorbitol, 3-ethoxy-1,2propanediol (ethoxypropanediol) and L-gulonic acid γ-lactone (gulonolactone) in improving peak shape of analytes for better peak sensitivity and quantitation during GC-MS analysis of pesticide residues were evaluated. The use of these analyte protectants were investigated with three pesticide groups i.e. organochlor...
متن کاملAdaptive K-Means Clustering
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering is based on K-means such that the data is partitioned into K clusters. In this method, the number of clusters is predefined and the technique is highly dependent on the initial identification of elements that represent...
متن کاملConstrained K-Means Clustering
We consider practical methods for adding constraints to the K-Means clustering algorithm in order to avoid local solutions with empty clusters or clusters having very few points. We often observe this phenomena when applying K-Means to datasets where the number of dimensions is n 10 and the number of desired clusters is k 20. We propose explicitly adding k constraints to the underlying clusteri...
متن کاملSubspace K-means clustering.
To achieve an insightful clustering of multivariate data, we propose subspace K-means. Its central idea is to model the centroids and cluster residuals in reduced spaces, which allows for dealing with a wide range of cluster types and yields rich interpretations of the clusters. We review the existing related clustering methods, including deterministic, stochastic, and unsupervised learning app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal media informatika Budidarma
سال: 2022
ISSN: ['2548-8368', '2614-5278']
DOI: https://doi.org/10.30865/mib.v6i4.4472